Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
نویسندگان
چکیده
This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of F× q6 , for q ≡ 1 mod 6. Our result arises from considering the Weil restriction of scalars of this group from Fq6 to Fq2 , and provides efficiency improvements for both pairingbased and torus-based cryptographic protocols. In particular we argue that such fields are ideally suited for the latter when the field characteristic satisfies p ≡ 1 (mod 6), and since torus-based techniques can be applied to the former, we present a compelling argument for the adoption of a single approach to efficient field arithmetic for pairing-based cryptography.
منابع مشابه
Squaring in cyclotomic subgroups
We propose new squaring formulae for cyclotomic subgroups of certain finite fields. Our formulae use a compressed representation of elements having the property that decompression can be performed at a very low cost. The squaring formulae lead to new exponentiation algorithms in cyclotomic subgroups which outperform the fastest previously-known exponentiation algorithms when the exponent has lo...
متن کاملOn Cyclotomic Polynomials with ± 1 Coefficients
We characterize all cyclotomic polynomials of even degree with coefficients restricted to the set {+1,−1}. In this context a cyclotomic polynomial is any monic polynomial with integer coefficients and all roots of modulus 1. Inter alia we characterize all cyclotomic polynomials with odd coefficients. The characterization is as follows. A polynomial P (x) with coefficients ±1 of even degree N − ...
متن کاملHigh Security Pairing-Based Cryptography Revisited
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We re-examine how one should implement pairings over ordinary elliptic curves for various practical levels of security. We conclude, contrary to prior work, that the Tate pairing is more efficient than the Weil pairing f...
متن کاملThe Gap between the Schur Group and the Subgroup Generated by Cyclic Cyclotomic Algebras
Let K be an abelian extension of the rationals. Let S(K) be the Schur group of K and let CC(K) be the subgroup of S(K) generated by classes containing cyclic cyclotomic algebras. We characterize when CC(K) has finite index in S(K) in terms of the relative position of K in the lattice of cyclotomic extensions of the rationals.
متن کاملFaster Explicit Formulas for Computing Pairings over Ordinary Curves
We describe e cient formulas for computing pairings on ordinary elliptic curves over prime elds. First, we generalize lazy reduction techniques, previously considered only for arithmetic in quadratic extensions, to the whole pairing computation, including towering and curve arithmetic. Second, we introduce a new compressed squaring formula for cyclotomic subgroups and a new technique to avoid p...
متن کامل